Determination of the merit factor of Legendre sequences
نویسندگان
چکیده
Golay has used the ergodicity postulate to calculate that the merit factor F of a Legendre sequence offset by a fraction f of its length has an asymptotic value given by l/F= (2/3)-41fj+ 8f2, IfI I l/2, which gives F= 6 for IfI =1/4. Here this is proved without using the ergodicity postulate.
منابع مشابه
Peak Side Lobe Levels of Legendre and Rudin-Shapiro Sequences: Families of Binary Sequences
Student, Assistant Professor Associate Professor Lendi Institute of Engineering and Technology, VZM, INDIA. Abstract: The peak side lobe level (PSL) is numerically estimated for Rudin-shapiro sequences and Legendre sequences which belong to the families of Binary sequences. Notable similarities are presented between PSL and merit factor behavior under cyclic rotations of the sequences (i.e. 1/4...
متن کاملTwo binary sequence families with large merit factor
We calculate the asymptotic merit factor, under all rotations of sequence elements, of two families of binary sequences derived from Legendre sequences. The rotation is negaperiodic for the first family, and periodic for the second family. In both cases the maximum asymptotic merit factor is 6. As a consequence, we obtain the first two families of skew-symmetric sequences with known asymptotic ...
متن کاملThe merit factor of binary sequence families constructed from m-sequences
We consider the asymptotic merit factor of two binary sequence families obtained from an initial binary sequence family using a “negaperiodic” and a “periodic” construction. When the initial sequences are m-sequences, both of the constructed families have the same asymptotic merit factor as the initial family, at all rotations of sequence elements. A similar property was previously shown to hol...
متن کاملAppended m-Sequences with Merit Factor Greater than 3.34
We consider the merit factor of binary sequences obtained by appending an initial fraction of an m-sequence to itself. We show that, for all sufficiently large n, there is some rotation of each m-sequence of length n that has merit factor greater than 3.34 under suitable appending. This is the first proof that the asymptotic merit factor of a binary sequence family can be increased under append...
متن کاملThe merit factor of binary sequences related to difference sets
Long binary sequences related to cyclic difference sets are investigated. Among all known constructions of cyclic difference sets we show that only sequences constructed from Hadamard difference sets can have an asymptotic nonzero merit factor. Maximal length shift register sequences, Legendre, and twin-prime sequences are all constructed from Hadamard difference sets. We prove that the asympto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 1988